A Poor Man's Evolving Algebra Compiler Universit at Karlsruhe Fakult at F Ur Informatik Leane a : a Poor Man's Evolving Algebra Compiler
نویسندگان
چکیده
The Prolog program \term_expansion((define C as A with B), (C=>A:-B,!)). implements a virtual machine for evolving algebras. It ooers an eecient and very exible framework for their simulation. Computation models and speciication methods seem to be worlds apart. The evolving algebra project started as an attempt to bridge the gap by improving on Turing's thesis.
منابع مشابه
Improving Data Layout through Coloring-Directed Array Merging
through Coloring-Directed Array Merging Daniela Genius Institut f ur Programmstrukturen und Datenorganisation, Fakult at f ur Informatik Universitat Karlsruhe Zirkel 2, 76128 Karlsruhe, Germany E-mail: [email protected], WWW: http://i44www.info.uni-karlsruhe.de/~genius Tel.: (+49) 721 608-4763 Fax: (+49) 721 30 0 47 Sylvain Lelait Institut f ur Computersprachen, Technische U...
متن کاملFree Variable Tableaux for Propositional Modal Logics Universit at Karlsruhe Fakult at F Ur Informatik Free Variable Tableaux for Propositional Modal Logics
We present a sound, complete, modular and lean labelled tableau calculus for many propositional modal logics where the labels contain \free" and \universal" variables. Our \lean" Prolog implementation is not only surprisingly short, but compares favourably with other considerably more complex implementations for modal deduction.
متن کاملBeyond Asymmetric Choice: A note on some extensions
1 Eindhoven University of Technology, Department of Mathematics and Computing Science P.O. Box 513, NL-5600 MB Eindhoven, The Netherlands, email: [email protected] 2 Humboldt-Universitat zu Berlin, Institut f ur Informatik Unter den Linden 6, D-10099 Berlin, Germany, email: [email protected] 3 Universitat Karlsruhe, Institut f ur Angewandte Informatik & Formale Beschreibungsve...
متن کاملleanEA A Poor Man’s Evolving Algebra Compiler
The Prolog program “term_expansion((define C as A with B), (C=>A:-B,!)). term_expansion((transition E if C then D), ((transition E):-C,!,B,A,(transition _))) :serialize(D,B,A). serialize((E,F),(C,D),(A,B)) :serialize(E,C,B), serialize(F,D,A). serialize(F:=G, ([G]=>*[E],F=..[C|D],D=>*B,A=..[C|B]), asserta(A=>E)). [G|H]=>*[E|F] :(G=\E; G=..[C|D],D=>*B,A=..[C|B],A=>E), !,H=>*F. []=>*[]. A=?B :[A,B...
متن کاملRelational Semantics for Modal Logics
Bernd{Holger Schlinglo Institut f ur Informatik, Technische Universitat M unchen, e-mail: [email protected] Wolfgang Heinle Institut f ur angewandte Mathematik, Universitat Bern, e-mail: [email protected] Abstract In this work we survey the connections between modal logic and relation algebra. We compare various modal and relational languages for the speci cation of reac...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995